Hiding Generalized Association Rules in RDF Databases
نویسنده
چکیده
One of the important usage of RDF documents is storing semi-structured and structured data for web information systems. But large repositories of data on the web may contain sensitive information that must be protected against unauthorized access. A possible problem, and still not investigated in this documents, is need to balance confidentiality of disclosed data with legitimate needs of the data users in RDF datasets that are commonly used on the web. In this paper, we present a Generalized Association Rule Hiding (GARH) algorithm, for hiding generalized associations from RDF metadata and evaluate the performance of the algorithm.
منابع مشابه
Introducing an algorithm for use to hide sensitive association rules through perturb technique
Due to the rapid growth of data mining technology, obtaining private data on users through this technology becomes easier. Association Rules Mining is one of the data mining techniques to extract useful patterns in the form of association rules. One of the main problems in applying this technique on databases is the disclosure of sensitive data by endangering security and privacy. Hiding the as...
متن کاملAssociation Rule Hiding for Data Mining
The best ebooks about Association Rule Hiding For Data Mining that you can get for free here by download this Association Rule Hiding For Data Mining and save to your desktop. This ebooks is under topic such as association rule hiding for data mining springer association rule hiding for data mining advances in association rule hiding knowledge and data engineering an efficient association rule ...
متن کاملAssociation Rule Hiding by Heuristic Approach to Reduce Side Effects & Hide Multiple R.H.S. Items
Association rule mining is a powerful model of data mining used for finding hidden patterns in large databases. One of the great challenges of data mining is to protect the confidentiality of sensitive patterns when releasing database to third parties. Association rule hiding algorithms sanitize database such that certain sensitive association rules cannot be discovered through association rule...
متن کاملA New Approach to Sensitive Rule Hiding
Privacy preserving data mining is a novel research direction in data mining and statistical databases, which has recently been proposed in response to the concerns of preserving personal or sensible information derived from data mining algorithms. There have been two types of privacy proposed concerning data mining. The first type of privacy, called output privacy, is that the data is altered s...
متن کاملSemantics of Constraints in RDFS
We study constraints for RDF-Schema (RDFS) graphs. The syntax and semantics is defined for constraints in graphs that can contain RDFS properties and blank nodes. The proposal for constraint satisfaction closely resembles the possible world approach found in various contexts of incomplete databases and knowledge bases. Positive decidability results for checking satisfaction of RDFS constraints ...
متن کامل